1153B - Serval and Toy Bricks - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define stream(line) istringstream in((line))
#define endl "\n"
#define F first
#define S second
#define clr(a, d) memset((a),d,sizeof(a))
const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int M = 100 + 5;

void print_vector(vector<int> &v) {
    for (ll i = 0; i < v.size(); ++i) {
        cout << v[i] << " ";
    }
    cout << endl;
}

ll dp[N][2];

int main() {
    fast
    int tc = 1;
    //cin >> tc;
    while (tc--) {
        int n,m, h;
        cin >> n >> m >> h;
        vector<int> r(n), c(m);
        for (int i = 0; i < m; ++i) {
            cin >> c[i];
        }
        for (int i = 0; i < n; ++i) {
            cin >> r[i];
        }
        int out[n+5][m+5];
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                cin >> out[i][j];
            }
        }
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                if(out[i][j]){
                    cout << min(r[i], c[j]) << " ";
                }else{
                    cout << 0 << " ";
                }
            }
            cout << endl;
        }

    }
    return 0;
}